منابع مشابه
Ordinal machines and admissible recursion theory
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines with time α and tape length α, for α some limit ordinal. This model of computation determines an associated computability theory: α-computability theory. We compare the new theory to α-recursion theory, which was developed by G. Sacks and his school. For α an admissible ordinal, the basic notions...
متن کاملAn Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...
متن کاملAn ordinal analysis of admissible set theory using recursion on ordinal notations ∗ Jeremy Avigad
The notion of a function from N to N defined by recursion on ordinal notations is fundamental in proof theory. Here this notion is generalized to functions on the universe of sets, using notations for well-orderings longer than the class of ordinals. The generalization is used to bound the rate of growth of any function on the universe of sets that is Σ1-definable in Kripke-Platek admissible se...
متن کاملAdmissible Criteria
We introduce methods for identifying operator preconditions that need not be expanded further. The methods are proved to be admissible , that is, they will not cause a solution to be missed when one exists. In certain cases, the methods also identify operator reformulations that increase the number of nonexpandable preconditions. This approach provides effective loop control in common situation...
متن کاملFUZZY NEXUS OVER AN ORDINAL
In this paper, we define fuzzy subnexuses over a nexus $N$. Define and study the notions of the prime fuzzy subnexuses and the fractionsinduced by them. Finally, we show that if S is a meetclosed subset of the set Fsub(N), of fuzzy subnexuses of a nexus N, andh= ⋀S ϵ S, then the fractions S^-1 N and h^-1 N are isomorphic as meet-semilattices.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1979
ISSN: 0003-4843
DOI: 10.1016/0003-4843(79)90025-1